Becoming Recursive: Toward a Computational Neuroscience Account of Recursion in Language and Thought

نویسنده

  • Simon D. Levy
چکیده

After remaining more or less in the background for several decades, the issue of recursion in human languages has returned to the fore. The current, vigorous debate is about not just recursion, but the very idea of linguistic universals as a coherent scientific notion, and the nature of language itself. The prevailing view is that recursion – the ability to produce an unbounded number of well-formed sentences through the combinatorial operations of syntax – is a fundamental property of the “faculty of language in the narrow sense” (FLN), i.e., that recursion is what differentiates human language from other forms of animal communication (Hauser, Chomsky, and Fitch 2002). As an explicit challenge this view, Everett (2005) has documented the syntax of Pirahã, a language that appears to have no embedded clauses, recursive possessives, or other syntactic structures suggesting this capacity. Everett offers Pirahã as a fatal counterexample to the universality of recursion, and questions the utility of searching for other sorts of linguistic universals as well. Although this debate has involved linguistics, and sometimes politics, we suggest that it might also be fruitfully informed by neuroscience. In particular, we will present a model of event semantics based on neurally plausible role/filler bindings, and describe how recursion, like other syntactic processes, can be viewed as the by-product of “unpacking” and serializing the contents of these representations. A rough outline of our argument: we start by enumerating some basic assumptions or ground rules about what any model of human language and cognition should look like. We then provide a review of simple vector arithmetic for the benefit of readers unfamiliar with this branch of mathematics, and we show how high-dimensional vectors can be used as a plausible model of role/filler semantics and other mental representations without violating any of our stated assumptions. Next we sketch the rudiments of a model of language that treats grammar as a process of transduction between these mental representations and sequences of symbols. We present a brief account of how this language model can be related to traditional syntactic categories like agent and theme, and conclude by setting the model in the context of current research on the sources of linguistic universals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The language faculty that wasn't: a usage-based account of natural language recursion

In the generative tradition, the language faculty has been shrinking-perhaps to include only the mechanism of recursion. This paper argues that even this view of the language faculty is too expansive. We first argue that a language faculty is difficult to reconcile with evolutionary considerations. We then focus on recursion as a detailed case study, arguing that our ability to process recursiv...

متن کامل

The (Non)Necessity of Recursion in Natural Language Processing

The prima facie unbounded nature of natural language, contrasted with the finite character of our memory and computational resources, is often taken to warrant a recursive language processing mechanism. The widely held distinction between an idealized infinite grammatical competence and the actual finite natural language performance provides further support for a recursive processor. In this pa...

متن کامل

On the DOmain Specificity Of the human Language facuLty anD the effectS Of principLeS Of cOmputatiOnaL efficiency: cOntraSting Language anD mathematicS

The growth of language in the individual is determined by genetics, experience and principles of computational efficiency. The latter are taken to be part of natural laws affecting the development of biological systems. We discuss the effect of two principles of computational efficiency applying to the derivation of linguistic expressions and their interface representations. We develop the hypo...

متن کامل

Agent Communication Language: Toward a Semantics Based on Success, Satisfaction, and Recursion

Searle and Vanderveken's model of speech acts is undoubtedly an adequate model for the design of communicating agents because it o ers a rich theory which can give important properties of protocols that we can formalize properly. We examine this theory by focusing on the two fundamentals notions, success and satisfaction, which represent a systematic, uni ed account of both the truth and the su...

متن کامل

Constituency and Recursion in Language

artificial languages, Christiansen and Chater (1999) show that the SRN’s general pattern of performance is relatively invariant across network size and training corpus, and conclude that the human-like pattern of performance derive from intrinsic constraints inherent in the SRN architecture. Connectionist models of recursive syntax typically use “toy” fragments of grammar and small vocabularies...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009